Parallel implementation of fast multipole method based on JASMIN
نویسندگان
چکیده
منابع مشابه
Simple recursive implementation of fast multipole method
In this paper we present an implementation of the well known “fast multipole” method for the efficient calculation of dipole fields, that uses polynomials in the Cartesian coordinates rather than spherical harmonics. This has considerable efficiency and simplicity advantages. We have implemented it in the context of an arbitrary hierarchical system of cells – no periodic mesh is required. The i...
متن کاملA parallel directional Fast Multipole Method
This paper introduces a parallel directional fast multipole method (FMM) for solving N-body problems with highly oscillatory kernels, with a focus on the Helmholtz kernel in three dimensions. This class of oscillatory kernels requires a more restrictive low-rank criterion than that of the low-frequency regime, and thus effective parallelizations must adapt to the modified data dependencies. We ...
متن کاملScalable and portable implementation of the fast multipole method on parallel computers
A scalable and portable Fortran code is developed to calculate Coulomb interaction potentials of charged particles on parallel computers, based on the fast multipole method. The code has a unique feature to calculate microscopic stress tensors due to the Coulomb interactions, which is useful in constant-pressure simulations and local stress analyses. The code is applicable to various boundary c...
متن کاملA Parallel Shared Memory Implementation of the Fast Multipole Method for Electromagnetics
An implementation of the multilevel Fast Multipole method for time harmonic electromagnetic computations is presented. The method is parallelized for shared memory machines. A new parallelization scheme which is a hybrid between previous methods is proposed. Several symmetries and other methods that reduce the storage requirement are proposed. The most important symmetry is for the translation ...
متن کاملElectromagnetics Computations Using the MPI Parallel Implementation of the Steepest Descent Fast Multipole Method (SDFMM)
The computational solution of large-scale linear systems of equations necessitates the use of fast algorithms but is also greatly enhanced by employing parallelization techniques. The objective of this work is to demonstrate the speedup achieved by the MPI (Message Passing Interface) parallel implementation of the Steepest Descent Fast Multipole Method (SDFMM). Although this algorithm has alrea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2011
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-011-4181-3